#include<bits/stdc++.h>
#define N 200005
#define int long long
using namespace std;
int n;
int b[N];
int monsters[N];
signed main()
{
    freopen("duel.in", "r", stdin);
    freopen("duel.out", "w", stdout);
    cin >> n;
    if(n == 1)
    {
        cout << 1 << endl;
        return 0;
    }
    for(int i = 1;i <= n;++i)
    {
        cin >> monsters[i];
    }
    sort(monsters + 1, monsters + 1 + n);
    int pm = 1;
    int tmp = monsters[1];
    ++b[pm];
    for(int i = 2;i <= n;)
    {
        while(monsters[i] == tmp)
        {
            ++b[pm];
            ++i;
        }
        tmp = monsters[i];
        ++pm;
    }
    int ans = LLONG_MIN;
    for(int i = 1;i <= n;++i)
    {
        ans = max(ans, b[i]);
    }
    cout << ans << endl;
    return 0;
}
